Deterministic and stochastic scheduling with teamwork tasks

We study a class of new scheduling problems which involve types of teamwork tasks. Each teamwork task consists of several components, and requires a team of processors to complete, with each team member to process a particular component of the task. Once the processor completes its work on the task, it will be available immediately to work on the next task regardless of whether the other components of the last task have been completed or not. Thus, the processors in a team neither have to start, nor have to finish, at the same time as they process a task. A task is completed only when all of its components have been processed. The problem is to find an optimal schedule to process all tasks, under a given objective measure. We consider both deterministic and stochastic models. For the deterministic model, we find that the optimal schedule exhibits the pattern that all processors must adopt the same sequence to process the tasks, even under a general objective function GC = F(f₁(C₁), f₂(C₂), … , f_n(C_n)), where f_i(C_i) is a general, nondecreasing function of the completion time C_i of task i. We show that the optimal sequence to minimize the maximum cost MC = max f_i(C_i) can be derived by a simple rule if there exists an order f₁(t) ≤ … ≤ f_n(t) for all t between the functions {f_i(t)}. We further show that the optimal sequence to minimize the total cost TC = ∑ f_i(C_i) can be constructed by a dynamic programming algorithm. For the stochastic model, we study three optimization criteria: (A) almost sure minimization; (B) stochastic ordering; and (C) expected cost minimization. For criterion (A), we show that the results for the corresponding deterministic model can be easily generalized. However, stochastic problems with criteria (B) and (C) become quite difficult. Conditions under which the optimal solutions can be found for these two criteria are derived. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

关于部分K值逻辑中正则可离函数集的极大封闭集之最小覆盖判定的一些结果

根据部分多值逻辑完备性理论,证明了当m=2时,若正则可离关系G2=G2({1,2})∪G2之关系图仅是一个回路,则T(G2)不是P k的最小覆盖成员.     

基于误差四元数的战术导弹垂直发射姿态调转滑模控制器

针对战术导弹垂直发射姿态调转时的快速性要求,研究了垂直发射快速姿态调转的控制问题。首先基于误差四元数并结合垂直发射的具体特点,建立了战术导弹垂直发射的非线性数学模型;然后通过滑模变结构控制理论进行控制系统设计,得出了基于误差四元数反馈控制器,分析了系统的稳定性和鲁棒性。该控制器实现了绕欧拉特征轴的旋转,缩短了姿态调转的时间,最后通过仿真验证其有效性。     

相空间有限元方法在解二维中子输运方程中的应用

本文采用相空间有限元方法求解了柱形临界多群中子输运问题。其中对于方程中的坐标变量用分片连续线性多项式作为试探函数,对于方程中的角度变量用分片连续双线性多项式作为试探函数。整个求解空间区域和角度区域分别采用三角形和矩形单元划分,然后利用迦辽金方法得到一个以网格点处角通量为未知数的线性联立代数方程组,方程组中的系数矩阵的存储采用了压缩存储技术。最后用高斯消元法解此有限元方程组,表明相空间有限元方法计算收敛性较好、计算精度高。     

判断实对称矩阵为正定、半正定、负定、半负定或不定的一个算法

给出判别实对称矩阵为正定、半正定、负定、半负定或不定的一个算法;采用选最大对角元的方法,可使数值计算稳定性好。讨论了该算法的运算量,得到乘除法和加减法总次数分别至多为ｎ（ｎ－１）（ｎ＋４）／６和ｎ（ｎ－１）（ｎ＋１）／６的结论。最后给出运行该算法的数值例子。     

等离子体粒子模拟中的改进型Borris旋动粒子方法

将等离子体粒子模拟中得到广泛应用的Borris旋动粒子方法进行了改进,用于精确求解相对论Lorentz运动方程。这种改进型Borris旋动方法在模拟粒子在强磁场中的动力学行为时仍具有相当高的计算精度,且耗费计算量较小。将改进型Borris旋动方法应用于等离子体粒子模拟中,尤其适用于模拟超强激光与等离子体的相互作用。     

Safe distances

This work highlights the problem in military operations of setting safety limits for friendly forces, neutral forces, or civilians, to avoid sustaining unnecessary casualties both in wartime and in training. We present and investigate an analytic model which both enables the quantitative understanding of the inherent problems, and which furnishes a reasonably flexible tool in the hands of the analyst. Characteristic numerical results are displayed and analyzed: They show in particular that prevailing crude approximations are inadequate. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 259–269, 2001     

四元数法在计算机图形学中的应用

详细介绍了四元数法的定义、性质以及在计算机图形学中的应用 ,获得了对给定轴旋转的有效四元数表示 ,比较了四元数法与传统方法在三维物体旋转中的优劣     

梁、板非线性动力响应分析的样条有限点法

本文用样条有限点法分析梁和基于Berger假设的板的几何非线性动力响应,推导了以样条结点参数表示的基本方程,用wilson-θ法求解动力增量方程,求得挠度响应曲线。本文的方法与有限元法比较,共计算时间省,程序简单,可在微机上计算。     

凸集支撑函数的性质及其应用

本文讨论一个凸集C 的支撑函数的几个有用性质,并把这些性质应用于对函数次微分的研究,得到有关函数次微分的几个有趣结果。